Lower bounds for on-line graph coloring
نویسندگان
چکیده
منابع مشابه
Safe Lower Bounds for Graph Coloring
The best known method for determining lower bounds on the vertex coloring number of a graph is the linear-programming column-generation technique first employed by Mehrotra and Trick in 1996. We present an implementation of the method that provides numerically safe results, independent of the floating-point accuracy of linearprogramming software. Our work includes an improved branch-and-bound a...
متن کاملLower Bounds for On-line Graph Colorings
We propose three strategies for Presenter in on-line graph coloring games. The first one constructs bipartite graphs and forces any on-line coloring algorithm to use 2 log2 n − 10 colors, where n is the number of vertices in the constructed graph. This is best possible up to an additive constant. The second strategy constructs triangle-free graphs and forces Ω(n 1 2 ) colors. The third one cons...
متن کاملLower Bounds for On-line Graph Coloring Magn us M. Halld orsson
An algorithm for vertex-coloring graphs is said to be on-line if each vertex is irrevocably assigned a color before later vertices are considered. We show that for every such algorithm, there exists a logn-colorable graph for which the algorithm uses at least 2n= logn colors. This also holds for randomized algorithms, to within a constant factor, against an oblivious adversary. We then show tha...
متن کاملBounds on spectrum graph coloring
We propose two vertex-coloring problems for graphs, endorsing the spectrum of colors with a matrix of interferences between pairs of colors. In the Threshold Spectrum Coloring problem, the number of colors is fixed and the aim is to minimize the maximum interference at a vertex (interference threshold). In the Chromatic Spectrum Coloring problem, a threshold is settled and the aim is to minimiz...
متن کاملRandomized Lower Bounds for Online Path Coloring
We study the power of randomization in the design of online path coloring algorithms. No specific network topology for which randomized online algorithms perform substantially better than deterministic algorithms is known until now. We present randomized lower bounds for online coloring on some well studied network topologies. We show that no randomized algorithm for online coloring of interval...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)90157-0